An Optimal Importance Sampling Method for a Transient Markov System
نویسندگان
چکیده
In this paper an optimal importance sampling (IS) method is derived for a transient markov system. Several propositions are presented. It is showned that the optimal IS method is unique, and it must converge to the standard Monte Carlo (MC) simulation method when the sample path length approaches infinity. Therefore, it is not the size of the state space of the Markov system, but the sample path length, that limits the efficiency of the IS method. Numerical results are presented to support the argument.
منابع مشابه
Optimal Importance Sampling in Markov Process Simulation
In this paper we present an adaptive algorithm to estimate the transient blocking probability of a communication system, described by a Markov process, during a finite time interval starting from a given state. The method uses importance sampling for variance reduction and adjusts the parameters of the twisted distribution based on earlier samples. The method can be effectively applied to a dec...
متن کاملAn efficient approach for availability analysis through fuzzy differential equations and particle swarm optimization
This article formulates a new technique for behavior analysis of systems through fuzzy Kolmogorov's differential equations and Particle Swarm Optimization. For handling the uncertainty in data, differential equations have been formulated by Markov modeling of system in fuzzy environment. First solution of these derived fuzzy Kolmogorov's differential equations has been found by Runge-Kutta four...
متن کاملAdaptive Importance Sampling for Uniformly Recurrent Markov Chains
Importance sampling is a variance reduction technique for efficient estimation of rare-event probabilities by Monte Carlo. In standard importance sampling schemes, the system is simulated using an a priori fixed change of measure suggested by a large deviation lower bound analysis. Recent work, however, has suggested that such schemes do not work well in many situations. In this paper, we consi...
متن کاملGlobal optimization using the asymptotically independent Markov sampling method
In this paper, we introduce a new efficient stochastic simulation method, AIMS-OPT, for approximating the set of globally optimal solutions when solving optimization problems such as optimal performance-based design problems. This method is based on Asymptotically Independent Markov Sampling (AIMS), a recently developed advanced simulation scheme originally proposed for Bayesian inference. This...
متن کاملDynamic Importance Sampling for Uniformly Recurrent Markov Chains
Importance sampling is a variance reduction technique for efficient estimation of rare-event probabilities by Monte Carlo. In standard importance sampling schemes, the system is simulated using an a priori fixed change of measure suggested by a large deviation lower bound analysis. Recent work, however, has suggested that such schemes do not work well in many situations. In this paper we consid...
متن کامل